Arctic circles, domino tilings and square Young tableaux
نویسنده
چکیده
The arctic circle theorem of Jockusch, Propp, and Shor asserts that uniformly random domino tilings of an Aztec diamond of high order are frozen with asymptotically high probability outside the “arctic circle” inscribed within the diamond. A similar arctic circle phenomenon has been observed in the limiting behavior of random square Young tableaux. In this paper, we show that random domino tilings of the Aztec diamond are asymptotically related to random square Young tableaux in a more refined sense that looks also at the behavior inside the arctic circle. This is done by giving a new derivation of the limiting shape of the height function of a random domino tiling of the Aztec diamond that uses the large-deviation techniques developed for the square Young tableaux problem in a previous paper by Pittel and the author. The solution of the variational problem that arises for domino tilings is almost identical to the solution for the case of square Young tableaux by Pittel and the author. The analytic techniques used to solve the variational problem provide a systematic, guess-free approach for solving problems of this type which have appeared in a number of related combinatorial probability models.
منابع مشابه
Local Statistics for Random Domino Tilings of the Aztec Diamond
We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of adjacent lattice squares. This formula quantiies the eeect of the dia-mond's boundary conditions on the behavior of typical tilings; in addition, it yields a new proof of ...
متن کاملSpaces of Domino Tilings
We consider the set of all tilings by dominoes (2 1 rectangles) of a surface, possibly with boundary, consisting of unit squares. Convert this set into a graph by joining two tilings by an edge if they diier by a ip, i.e., a 90 rotation of a pair of side-by-side dominoes. We give a criterion to decide if two tilings are in the same connected component, a simple formula for distances and a metho...
متن کاملCombinatorial Approaches and Conjectures for 2-Divisibility Problems Concerning Domino Tilings of Polyominoes
We give the first complete combinatorial proof of the fact that the number of domino tilings of the 2n × 2n square grid is of the form 2(2k + 1)2, thus settling a question raised in [4] . The proof lends itself naturally to some interesting generalizations, and leads to a number of new conjectures. Mathematical Subject Classification. Primary 05C70.
متن کامل2-adic Behavior of Numbers of Domino Tilings
We study the 2-adic behavior of the number of domino tilings of a 2n× 2n square as n varies. It was previously known that this number was of the form 2nf(n)2, where f(n) is an odd, positive integer. We show that the function f is uniformly continuous under the 2-adic metric, and thus extends to a function on all of . The extension satisfies the functional equation f(−1 − n) = ±f(n), where the s...
متن کاملDomino tilings with diagonal impurities
This paper studies the dimer model on the dual graph of the square-octagon lattice, which can be viewed as the domino tilings with impurities in some sense. In particular, under a certain boundary condition, we give an exact formula representing the probability of finding an impurity at a given site in a uniformly random dimer configuration in terms of simple random walks on the square lattice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010